Block dense weighted networks with augmented degree correction

نویسندگان

چکیده

Abstract Dense networks with weighted connections often exhibit a community-like structure, where although most nodes are connected to each other, different patterns of edge weights may emerge depending on node’s community membership. We propose new framework for generating and estimating dense potentially connectivity across communities. The proposed model relies particular class functions which map individual node characteristics the edges connecting those nodes, allowing flexibility while requiring small number parameters relative edges. By leveraging estimation techniques, we also develop bootstrap methodology same set vertices, be useful in circumstances multiple data sets cannot collected. Performance these methods is analyzed theory, simulations, real data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synchronization in weighted scale free networks with degree-degree correlation

We study synchronization phenomena in scale-free networks of asymmetrically coupled dynamical systems featuring degree-degree correlation in the topology of the connection wiring. We show that when the interaction is dominant from the high-degree to the low-degree (from the low-degree to the high degree) nodes, synchronization is enhanced for assortative (disassortative) degree-degree correlati...

متن کامل

Approximating Directed Weighted-Degree Constrained Networks

Given a graph H = (V, F ) with edge weights {we : e ∈ F}, the weighted degree of a node v in H is ∑ {wvu : vu ∈ F}. We give bicriteria approximation algorithms for problems that seek to find a minimum cost directed graph that satisfies both intersecting supermodular connectivity requirements and weighted degree constraints. The input to such problems is a directed graph G = (V,E) with edge-cost...

متن کامل

Learning latent block structure in weighted networks

Community detection is an important task in network analysis, in which we aim to learn a network partition that groups together vertices with similar community-level connectivity patterns. By finding such groups of vertices with similar structural roles, we extract a compact representation of the network’s large-scale structure, which can facilitate its scientific interpretation and the predict...

متن کامل

On the rich-club effect in dense and weighted networks

For many complex networks present in nature only a single instance, usually of large size, is available. Any measurement made on this single instance cannot be repeated on different realizations. In order to detect significant patterns in a real-world network it is therefore crucial to compare the measured results with a null model counterpart. Here we focus on dense and weighted networks, prop...

متن کامل

Weighted Matchings for Dense

The calculation of matches between pixels, points, or other features in stereo images is known as the correspondence problem. This problem is ill-posed due to occlusions; not every pixel, point or feature in one stereo image has a match in the other. Minimization of a cost function over some local region and dynamic programming algorithms are two well-known strategies for computing dense corres...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Network Science

سال: 2022

ISSN: ['2050-1250', '2050-1242']

DOI: https://doi.org/10.1017/nws.2022.23